Analytic Visibility on the GPU
نویسندگان
چکیده
This paper presents a parallel, implementation-friendly analytic visibility method for triangular meshes. Together with an analytic filter convolution, it allows for a fully analytic solution to anti-aliased 3D mesh rendering on parallel hardware. Building on recent works in computational geometry, we present a new edge-triangle intersection algorithm and a novel method to complete the boundaries of all visible triangle regions after a hidden line elimination step. All stages of the method are embarrassingly parallel and easily implementable on parallel hardware. A GPU implementation is discussed and performance characteristics of the method are shown and compared to traditional sampling-based rendering methods.
منابع مشابه
GPU-based parallel algorithm for computing point visibility inside simple polygons
Given a simple polygon P in the plane, we present a parallel algorithm for computing the visibility polygon of an observer point q inside P. We use chain visibility concept and a bottom-up merge method for constructing the visibility polygon of point q. The algorithm is simple and mainly designed for GPU architectures, where it runs in O(log n) time using O(n) processors. This is the first work...
متن کاملPreprint: Visibility Sampling on GPU and Applications
In this paper, we show how recent GPUs can be used to very efficiently and conveniently sample the visibility between two surfaces, given a set of occluding triangles. We use bitwise arithmetics to evaluate, encode, and combine the samples blocked by each triangle. In particular, the number of operations is almost independent of the number of samples. Our method requires no CPU/GPU transfers, i...
متن کاملRay Tracing with Selective Visibility
We propose a simple yet eeective extension of ray-tracing algorithm that allows selective visibility of objects for speciic rays. Typically, rays are clas-siied as pixel, shadow, reeected and transmitted. We suggest adding a visibility mask to material descriptions , which controls how these rays interact with the material. This addition can be incorporated seamlessly into any ray-tracer and ma...
متن کاملFast Approximate Visibility on the GPU using pre- computed 4D Visibility Fields
We present a novel GPU-based method for accelerating the visibility function computation of the lighting equation in dynamic scenes composed of rigid objects. The method pre-computes, for each object in the scene, the visibility and normal information, as seen from the environment, onto the bounding sphere surrounding the object and encodes it into maps. The visibility function is encoded by a ...
متن کاملSVGPU: real time 3D rendering to vector graphics formats
We focus on the real-time realistic rendering of a 3-D scene to a 2-D vector image. There are several application domains which could benefit substantially from the compact and resolution independent intermediate format that vector graphics provides. In particular, cloud streaming services, which transmit large amounts of video data and notoriously suffer from low resolution and/or high latency...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Comput. Graph. Forum
دوره 32 شماره
صفحات -
تاریخ انتشار 2013